Digital metrics: A graph-theoretical approach

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Digital metrics: A graph-theoretical approach

Consider the following two graphs M a n d N, both with vertex set Z×Z, where Z is the set of all integers. In M, two vertices are adjacent when their euclidean distance is 1, while in N, adjacency is obtained when the distance is either 1 or 1/2. By definition, H is a metric subgraph of the graph G if the distance between any two points o f / 4 is the same as their distance in G. We determine a...

متن کامل

Slicing Concurrent Programs - A Graph-Theoretical Approach

This paper extends the notion of slicing, which was originally proposed and studied for sequential programs, to concurrent programs and presents a graph-theoretical approach to slicing concurrent programs. In addition to the usual control and data dependences proposed and studied for sequential programs, the paper introduces three new types of primary program dependences in concurrent programs,...

متن کامل

A graph theoretical approach to data fusion.

The rapid development of high throughput experimental techniques has resulted in a growing diversity of genomic datasets being produced and requiring analysis. Therefore, it is increasingly being recognized that we can gain deeper understanding about underlying biology by combining the insights obtained from multiple, diverse datasets. Thus we propose a novel scalable computational approach to ...

متن کامل

Kähler Metrics: String vs Field Theoretical Approach

We use both a string and a field theoretical approach in order to determine respectively the Kähler metrics of untwisted and twisted open strings attached to magnetized D9 branes in toroidal compactifications. Work partially supported by the European Community’s Human Potential Programme under contract MRTN-CT-2004-005104 “Constituents, Fundamental Forces and Symmetries of the Universe”.

متن کامل

Graph-theoretical properties of parallelism in the digital plane

We propose different graph-theoretical algorithms to partition a set of digitized lines into parallel groups, i.e., subsets in which each line is parallel to the other lines in the subset. The slope of a digitized line is not a fixed real number, but is represented by an interval. Likewise, the parallel relations of a collection of lines is represented by an interval graph. The extraction of pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition Letters

سال: 1984

ISSN: 0167-8655

DOI: 10.1016/0167-8655(84)90040-0